Spectral Partitiong in a Stochastic Block Model
نویسنده
چکیده
In this lecture, we will perform a crude analysis of the performance of spectral partitioning algorithms in what are called stochastic block models or a planted partition model. The name you choose largely depends on your community and application. As we are especially interested today in partitioning, we will call it the planted partition model. In this model, we build a random graph that has a natural partition.
منابع مشابه
Stochastic Block Model and Community Detection in the Sparse Graphs: A spectral algorithm with optimal rate of recovery
In this paper, we present and analyze a simple and robust spectral algorithm for the stochastic block model with k blocks, for any k fixed. Our algorithm works with graphs having constant edge density, under an optimal condition on the gap between the density inside a block and the density between the blocks. As a co-product, we settle an open question posed by Abbe et. al. concerning censor bl...
متن کاملStochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery
In this paper, we present and analyze a simple and robust spectral algorithm for the stochastic block model with k blocks, for any k fixed. Our algorithm works with graphs having constant edge density, under an optimal condition on the gap between the density inside a block and the density between the blocks. As a co-product, we settle an open question posed by Abbe et. al. concerning censor bl...
متن کاملSpectral clustering and the high-dimensional Stochastic Block Model
Networks or graphs can easily represent a diverse set of data sources that are characterized by interacting units or actors. Social networks, representing people who communicate with each other, are one example. Communities or clusters of highly connected actors form an essential feature in the structure of several empirical networks. Spectral clustering is a popular and computationally feasibl...
متن کاملA Chance Constrained Integer Programming Model for Open Pit Long-Term Production Planning
The mine production planning defines a sequence of block extraction to obtain the highest NPV under a number of constraints. Mathematical programming has become a widespread approach to optimize production planning, for open pit mines since the 1960s. However, the previous and existing models are found to be limited in their ability to explicitly incorporate the ore grade uncertainty into the p...
متن کاملSpectral thresholds in the bipartite stochastic block model
1 We consider a bipartite stochastic block model on vertex sets V1 and V2, with planted partitions in each, and ask at what densities efficient algorithms can recover the partition of the smaller vertex set. When |V2| |V1|, multiple thresholds emerge. We first locate a sharp threshold for detection of the partition, in the sense of the results of Mossel et al. (2014, 2013) and Massoulié (2014) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015